Reliable computation with cellular automata
نویسندگان
چکیده
منابع مشابه
Reliable Cellular Automata with Self-Organization
In a noisy cellular automaton, even if it is infinite, it is nontrivial to keep a bit of information for more than a constant number of steps. A clever solution in 2 dimensions has been applied to a simple 3-dimensional fault-tolerant cellular automaton. This technique did not solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3, or...
متن کاملCellular Automata, Modeling, and Computation
Cellular Automata (CA) based simulations are widely used in a great variety of domains, from statistical physics to social science. They allow for spectacular displays and numerical predictions. Are they for all that a revolutionary modeling tool, allowing for “direct simulation” (Morgan and Morrison 1999, 29), or for the simulation of “the phenomenon itself” (Fox Keller 2003)? Or are they mere...
متن کاملEmergent Computation in Cellular Automata
We study the ability of a genetic algorithm to design cellular automata exhibiting spontaneous global synchronization. We show that in order to produce emergent coordination , the evolutionary process can take advantage of the underlying medium's potential to form embedded particles. The particles, typically phase defects between synchronous regions, are designed by the evolutionary process to ...
متن کاملReversible Computation in Asynchronous Cellular Automata
Reversible computation has attracted much attention over the years, not only for its promise for computers with radically reduced power consumption, but also for its importance for Quantum Computing. Though studied extensively in a great variety of synchronous computation models, it is virtually unexplored in an asynchronous framework. Particularly suitable asynchronous models for the study of ...
متن کاملComputation by Asynchronously Updating Cellular Automata
A known method to compute on an asynchronously updating cellular automaton is the simulation of a synchronous computing model on it. Such a scheme requires not only an increased number of cell states, but also the simulation of a global synchronization mechanism. Asynchronous systems tend to use synchronization only on a local scale—if they use it at all. Research on cellular automata that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90002-4